Matching in Dynamic Imbalanced Markets
نویسندگان
چکیده
Abstract We study dynamic matching in exchange markets with easy- and hard-to-match agents. A greedy policy, which attempts to match agents upon arrival, ignores the positive externality that waiting provide by facilitating future matchings. prove trade-off between a “thicker” market faster vanishes large markets; policy leads shorter times more matched than any other policy. empirically confirm these findings data from National Kidney Registry. Greedy achieves as many transplants commonly used policies (1.8$\%$ monthly batching) (16 days batching).
منابع مشابه
Competing Dynamic Matching Markets
While dynamic matching markets are usually modeled in isolation, assuming that every agent to be matched enters that market, in many real-world settings there exist rival matching markets with overlapping pools of agents. We extend a framework of dynamic matching due to Akbarpour et al. [2] to characterize outcomes in cases where two such rival matching markets compete with each other. One mark...
متن کاملStability in dynamic matching markets
A dynamic two-sided matching market is considered. We examine two existing notions of stability—the core and recursive core—for this multi-period market and argue that they both have limitations. We define two new notions of stability and label them, self-sustaining stability and strict self-sustaining stability. Both concepts can be viewed as the recursive core with more stringent conditions f...
متن کاملAdverse selection in dynamic matching markets
We study the Akerlofian adverse selection problem in a dynamic matching model where the competitive situation varies across different meetings. The 'lemons principle' is shown to limit the high quality sales within a wider range of quality distributions than in the Walrasian benchmark. High quality goods can nevertheless be traded, albeit less frequently than the low quality goods. For certain ...
متن کاملMaximizing Efficiency in Dynamic Matching Markets
We study the problem of matching agents who arrive at a marketplace over time and leave after d time periods. Agents can only be matched while they are present in the marketplace. Each pair of agents can yield a different match value, and the planner’s goal is to maximize the total value over a finite time horizon. We study matching algorithms that perform well over any sequence of arrivals whe...
متن کاملDynamic Matching Markets and Voting Paths
We consider a matching market, in which the aim is to maintain a popular matching between a set of applicants and a set of posts, where each applicant has a preference list ranking a subset of posts in some order of preference. A matching M is popular if there is no other matching M′ such that the number of applicants who prefer their partners in M′ to M exceeds the number of applicants who pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Review of Economic Studies
سال: 2022
ISSN: ['0034-6527', '1467-937X']
DOI: https://doi.org/10.1093/restud/rdac044